| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 83LX3pFwXQZ4BFjAq/jhcmy |
| Repository | dpi.inpe.br/vagner/1999/11.26.17.01 |
| Last Update | 2000:01.03.02.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2001/03.30.15.57.51 |
| Metadata Last Update | 2022:06.14.00.17.05 (UTC) administrator |
| DOI | 10.1109/SIBGRA.1999.805592 |
| Citation Key | RezendeWest:1999:OpAlCo |
| Title | An optimal algorithm to construct all voronoi diagrams for k nearest neighbor search in T2  |
| Year | 1999 |
| Access Date | 2024, May 02 |
| Number of Files | 3 |
| Size | 220 KiB |
| 2. Context | |
| Author | 1 Rezende, Pedro J. de 2 Westrupp, Rodrigo B. |
| Editor | Stolfi, Jorge Tozzi, Clésio Luis |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 12 (SIBGRAPI) |
| Conference Location | Campinas, SP, Brazil |
| Date | 17-20 Oct. 1999 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Pages | 7-15 |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| Organization | SBC - Brazilian Computer Society and UNICAMP - University of Campinas |
| History (UTC) | 2008-07-17 14:17:59 :: administrator -> banon :: 2008-08-26 15:23:57 :: banon -> administrator :: 2009-08-13 20:36:19 :: administrator -> banon :: 2010-08-28 20:04:54 :: banon -> administrator :: 2022-06-14 00:17:05 :: administrator -> :: 1999 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | t2 voronoi euclidean k |
| Abstract | In this paper, we generalize to the oriented projective plane T2 an algorithm for constructing all order k Voronoi diagram in the Euclidean plane. We also show that, for fixed K and for a finite set of sites, an order K Voronoi diagram in T2 has an exact number of regions. Furthermore, we show that the order K Voronoi diagram of a se of n sites in T2 is antipodal to its order n - K Voronoi diagram, VK: 1-< K < n. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 1999 > An optimal algorithm... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > An optimal algorithm... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/83LX3pFwXQZ4BFjAq/jhcmy |
| zipped data URL | http://urlib.net/zip/83LX3pFwXQZ4BFjAq/jhcmy |
| Target File | 014-31421568.pdf |
| User Group | administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46PDF8P 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/04.25.03.44 5 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Notes | The conference was held in Campinas, SP, Brazil, from October 17 to 20. |
| Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label language lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |